Place-labelled Petri net controlled grammars
نویسندگان
چکیده
منابع مشابه
Petri Net Controlled Grammars: the Case of Special Petri Nets
A Petri net controlled grammar is a context-free grammar equipped with a Petri net, whose transitions are labeled with rules of the grammar or the empty string, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is...
متن کاملGrammars Controlled by Petri Nets
Formal language theory, introduced by Noam Chomsky in the 1950s as a tool for a description of natural languages [8–10], has also been widely involved in modeling and investigating phenomena appearing in computer science, artificial intelligence and other related fields because the symbolic representation of a modeled system in the form of strings makes its processes by information processing t...
متن کاملTransforming Business Patterns to Labelled Petri Nets using Graph Grammars
In this paper we propose an approach and a tool for transforming business patterns to labelled Petri nets for which efficient analysis techniques exist. We specify first, business patterns and labelled Petri nets Meta-Models in UML Class Diagram formalism with the Meta-Modelling tool Atom, and then we generate visual modelling tools according to the proposed Meta-Models. Finally, we define a gr...
متن کاملPetri Net Controlled Finite Automata
We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by λ-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined b...
متن کاملPetri Net Synthesis from Labelled Transition Systems and from Languages
Net synthesis can be understood as an algorithmic procedure aimed at constructing a Petri net structure from a specification of its intended or desired behaviour, given typically in the form of a transition system or a formal language. The procedure has to decide whether such a specification can be realised and, if the answer is positive, deliver as efficiently as possible a Petri net with the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ScienceAsia
سال: 2017
ISSN: 1513-1874
DOI: 10.2306/scienceasia1513-1874.2017.43s.009